Algorithmic Algebraic Model Checking III: Approximate Methods
نویسندگان
چکیده
We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semialgebraic hybrid systems, and demonstrate how they relate to and extend other existing techniques.
منابع مشابه
Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical systems to examine how a biochemical hybrid dynamical system can be made amenable to temporal analysis, even when the initial conditions and unknown parameters may only be treated as symbolic variables. This paper examine...
متن کاملSolving Fully Parameterized Singularly Perturbed Non-linear Parabolic and Elliptic Pde’s by Explicit Approximate Inverse Fe Matrix Algorithmic Methods
A class of generalized approximate inverse finite element matrix algorithmic methods for solving nonlinear parabolic and elliptic PDE’s, is presented. Fully parameterized singularly perturbed non-linear parabolic and elliptic PDE’s are considered and explicit preconditioned generalized conjugate gradient type schemes are presented for the efficient solution of the resulting nonlinear systems of...
متن کاملAlgorithmic Algebraic Model Checking I: Challenges from Systems Biology
In this paper, we suggest a possible confluence of the theory of hybrid automata and the techniques of algorithmic algebra to create a computational basis for systems biology. We describe a method to compute bounded reachability by combining Taylor polynomials and cylindric algebraic decomposition algorithms. We discuss the power and limitations of the framework we propose and we suggest severa...
متن کاملAlgorithmic Algebraic Model Checking II: Decidability of Semi-algebraic Model Checking and Its Applications to Systems Biology
Motivated by applications to systems biology, and the emergence of semi-algebraic hybrid systems as a natural framework for modeling biochemical networks, we continue exploring the decidability problem for model-checking with TCTL (Timed Computation Tree Logic) over this broad class of semi-algebraic hybrid systems. Previously, we had introduced these models, demonstrated the close connection t...
متن کاملSymbolic Model Checking Using Algebraic Geometry
In this paper, I show that methods from computational algebraic geometry can be used to carry out symbolic model checking using an encoding of Boolean sets as the common zeros of sets of polynomials. This approach could serve as a useful supplement to symbolic model checking methods based on Ordered Binary Decision Diagrams and may provide important theoretical insights by bringing the powerful...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 149 شماره
صفحات -
تاریخ انتشار 2006